A dynamic free-entry oligopoly with sluggish entry and exit adjustments

We study a dynamic free-entry oligopoly with sluggish entry and exit of firms under general demand and cost functions. We show that the number of firms in a steady-state open-loop solution for a dynamic free-entry oligopoly is smaller than that at static equilibrium and that the number of firms in a steady-state memoryless closed-loop solution is larger than that in an open-loop solution.     

基于利他偏好的电商供应链最优决策与契约协调

构建了由一个占主导地位的电商平台和一个处于跟随地位的制造商组成的Stackelberg主从博弈模型,研究了电商平台有无利他偏好时电商供应链的最优决策和契约协调问题,并通过数值算例验证了本文的主要结论.研究表明:电商平台的利他偏好行为能够促使自身服务水平提高、正向影响制造商的最优销售价格并削弱自身利润.但电商平台的让利行为能够提高制造商的利润水平、缓和供应链冲突并改善供应链整体绩效."销售佣金比例+服务成本共担"契约能够完美的协调电商供应链,使双方最优利润获得帕累托改进,从而保证电商平台有足够的激励执行利他偏好行为.另外,进一步分析发现电商平台的利他偏好正向影响制造商支付给电商平台的固定技术服务费、制造商占有的电商供应链利润份额和服务成本分担比例,负向影响自身的销售佣金比例.     

Stability of equilibrium solutions of a double power reaction-diffusion equation with a Dirac interaction

In this paper, information about the instability of equilibrium solutions of a nonlinear family of localized reaction-diffusion equations in dimension one is provided. More precisely, explicit formulas to the equilibrium solutions are computed and, via analytic perturbation theory, the exact number of positive eigenvalues of the linear operator associated to the stability problem is analyzed. In addition, sufficient conditions for blow up of the solutions of the equation are also discussed.     

政府监管下的医院医疗信息分享演化博弈分析

在分析政府监管下医院间医疗信息分享特征的基础上,结合我国当前正在推行的医联体医院间信息分享运作模式,引入梅特卡夫定律并考虑患者评价的影响,分析了监管部门与医院各自的利益组成,建立了监管部门与医院两者之间的演化博弈模型,并采用复制动态方程研究了不同情形下医院间信息分享的演化博弈轨迹。研究表明,政府通过监管并建立激励惩罚机制等引导措施对医院最终达到的演化稳定态具有极大影响;降低医院主体信息分享的风险成本、规范提高医院分享信息的质量、引导患者增强对医院信息分享的关注、制定有吸引力和威慑力的奖惩政策,是促进医院医疗信息分享的关键。研究结果可为政府监管部门预测医院间的信息分享趋势和制定精准化政策以促进分享提供参考。     

Information percolation and cutoff for the random‐cluster model

We consider the random‐cluster model (RCM) on with parameters p∈(0,1) and q ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probability p) which is biased by a factor q raised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the system unlike the Glauber heat‐bath dynamics for spin systems, and prove that for all small enough p (depending on the dimension) and any q>1, the FK‐dynamics exhibits the cutoff phenomenon at with a window size , where λ_∞ is the large n limit of the spectral gap of the process. Our proof extends the information percolation framework of Lubetzky and Sly to the RCM and also relies on the arguments of Blanca and Sinclair who proved a sharp mixing time bound for the planar version. A key aspect of our proof is the analysis of the effect of a sequence of dependent (across time) Bernoulli percolations extracted from the graphical construction of the dynamics, on how information propagates.